Using Quad Tree as Data Storage for a Terrain Representation and a Core for a Path Finding Algorithm
نویسنده
چکیده
منابع مشابه
An efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملA New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining
Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...
متن کاملLarge Scale Terrain Real-Time Rendering on GPU Using Double Layers Tile Quad Tree and Cuboids Bounding Error Metric
Improving terrain tile data selection efficiency, real-time loading of visible tile data and building GPU-based continuous Level of Details (LOD) are the key technologies for large scale terrain rendering on GPU. In this article, in order to reduce terrain tile data selection time, we build double layers tile quad tree for massive terrain data and organize tile data by designing Z-order space f...
متن کاملOptimizing the Search in Hierarchical Database using Quad Tree
This research work is done to optimize the search in hierarchal database by using Quad Tree. Quad Tree is a tree which consists of a node having 4 sub child nodes.[1] Quad Tree is used in many fields such as computer graphics to find out a desired pixel in graphics and collision detection in 3-D gaming. There are various other applications of quad tree in different fields like weather forecasti...
متن کاملAutomatic QoS-aware Web Services Composition based on Set-Cover Problem
By definition, web-services composition works on developing merely optimum coordination among a number of available web-services to provide a new composed web-service intended to satisfy some users requirements for which a single web service is not (good) enough. In this article, the formulation of the automatic web-services composition is proposed as several set-cover problems and an approxima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012